Characterizing DAG-depth of Directed Graphs
نویسنده
چکیده
We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the treedepth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on directed graphs and prove its correctness. The DAG-depth decomposition is related to DAG-depth in a similar way as an elimination tree is related to the tree-depth. We study the size aspect of DAG-depth decomposition and provide a definition of mergeable and optimally mergeable vertices in order to make the decomposition smaller and acceptable for the cop player as a strategy. We also provide a way to find the closure of a DAG-depth decomposition, which is the largest digraph for which the given decomposition represents a winning strategy for the cop player.
منابع مشابه
Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables
It is well known that there may be many causal explanations that are consistent with a given set of data. Recent work has been done to represent the common aspects of these explanations into one representation. In this paper, we address what is less well known: how do the relationships common to every causal explanation among the observed variables of some DAG process change in the presence of ...
متن کاملAbout the Completeness of Depth-First Proof-Number Search
Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its theoretical properties remain poorly understood. This paper resolves the question of completeness of df-pn: its ability to solve any finite boolean-valued game tree search problem in principle, given unlimited amounts of time an...
متن کاملThe dag-width of directed graphs
Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in algorithm design. Treewidth can be characterised by a graph searching game where a number of cops attempt to capture a robber. We consider the natural adaptation of this game to directed graphs and show that monotone strategies in the game...
متن کاملLongest Path Distance in Random Circuits
We study distance properties of a general class of random directed acyclic graphs (DAGs). In a DAG, many natural notions of distance are possible, for there exists multiple paths between pairs of nodes. The distance of interest for circuits is the maximum length of a path between two nodes. We give laws of large numbers for the typical depth (distance to the root) and the minimum depth in a ran...
متن کاملWeighted DAG Automata for Semantic Graphs
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the frameworks of finite automata for strings and finite tree automata for trees. A possible starting point for such a framework is the formalism of ...
متن کامل